Estimation of Dynamic Bivariate Correlation Using a Weighted Graph Algorithm
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولParameter Estimation of Loranz Chaotic Dynamic System Using Bees Algorithm
An important problem in nonlinear science is the unknown parameters estimation in Loranz chaotic system. Clearly, the parameter estimation for chaotic systems is a multidimensional continuous optimization problem, where the optimization goal is to minimize mean squared errors (MSEs) between real and estimated responses for a number of given samples. The Bees algorithm (BA) is a new member of me...
متن کاملEstimation of Count Data using Bivariate Negative Binomial Regression Models
Abstract Negative binomial regression model (NBR) is a popular approach for modeling overdispersed count data with covariates. Several parameterizations have been performed for NBR, and the two well-known models, negative binomial-1 regression model (NBR-1) and negative binomial-2 regression model (NBR-2), have been applied. Another parameterization of NBR is negative binomial-P regression mode...
متن کاملA Graph Pebbling Algorithm on Weighted Graphs
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarante...
متن کاملCommunication Centrality in Dynamic Networks Using Time-Ordered Weighted Graph
Centrality is an important concept in the study of social network analysis (SNA), which is used to measure the importance of a node in a network. While many different centrality measures exist, most of them are proposed and applied to static networks. However, most types of networks are dynamic that their topology changes over time. A popular approach to represent such networks is to construct ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2020
ISSN: 1099-4300
DOI: 10.3390/e22060617